Maximum likelihood estimates of pairwise rearrangement distances
نویسندگان
چکیده
منابع مشابه
Maximum likelihood estimates of pairwise rearrangement distances.
Accurate estimation of evolutionary distances between taxa is important for many phylogenetic reconstruction methods. Distances can be estimated using a range of different evolutionary models, from single nucleotide polymorphisms to large-scale genome rearrangements. Corresponding corrections for genome rearrangement distances fall into 3 categories: Empirical computational studies, Bayesian/MC...
متن کاملFast and accurate estimation of the covariance between pairwise maximum likelihood distances
Pairwise evolutionary distances are a model-based summary statistic for a set of molecular sequences. They represent the leaf-to-leaf path lengths of the underlying phylogenetic tree. Estimates of pairwise distances with overlapping paths covary because of shared mutation events. It is desirable to take these covariance structure into account to increase precision in any process that compares o...
متن کاملModel Fit after Pairwise Maximum Likelihood
Maximum likelihood factor analysis of discrete data within the structural equation modeling framework rests on the assumption that the observed discrete responses are manifestations of underlying continuous scores that are normally distributed. As maximizing the likelihood of multivariate response patterns is computationally very intensive, the sum of the log-likelihoods of the bivariate respon...
متن کاملEstimates of Introgression as a Function of Pairwise Distances
We introduce a new method to detect introgressed loci by combining two widely used statistics: dxy (the average pairwise nucleotide diversity between population x and y) and the four-taxon Patterson’s D statistic. The result is a statistic that takes into account genetic distance across possible topologies named the Bdf and is designed to detect and at the same time to quantify introg...
متن کاملBeyond pairwise distances: neighbor-joining with phylogenetic diversity estimates.
The "neighbor-joining algorithm" is a recursive procedure for reconstructing trees that is based on a transformation of pairwise distances between leaves. We present a generalization of the neighbor-joining transformation, which uses estimates of phylogenetic diversity rather than pairwise distances in the tree. This leads to an improved neighbor-joining algorithm whose total running time is st...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Theoretical Biology
سال: 2017
ISSN: 0022-5193
DOI: 10.1016/j.jtbi.2017.04.015